Bounding the Computation Time of Forward-Chaining Rule-Based Systems
نویسندگان
چکیده
Tomsovic, K. and C-C. Liu, Bounding the computation time of forward-chaining rule-based systems, Data & Knowledge Engineering 10 (1993) 317-334. For real-time applications of expert systems, success depends on the computational efficiency of the implementation. In this study, we propose an analytical method for evaluating the processing time of forward-chaining rule-based systems. An upper bound based on this system model is developed. If the upper bound stays within the time available for planning the operational or control task, the expert system would be able to complete the rule-processing in time. To compute the upper bound, the worst case working memory element sets are obtained for each functional step of the matching procedure. The worst case time for rule selection in the conflict resolution step is also derived. The maximal number of firings for each rule is considered in order to arrive at a bound for total processing time. Numerical examples are presented which point out the importance of rule and data structures in the efficient implementation of rule-based systems.
منابع مشابه
Type-2 Fuzzy Hybrid Expert System For Diagnosis Of Degenerative Disc Diseases
One-third of the people with an age over twenty have some signs of degenerated discs. However, in most of the patients the mere presence of degenerative discs is not a problem leading to pain, neurological compression, or other symptoms. This paper presents an interval type-2 fuzzy hybrid rule-based system to diagnose the abnormal degenerated discs where pain variables are represented by interv...
متن کاملSecond-Order Queries for Rule-Based Data Access
Rules and ontologies can be used to enrich a database system with advanced data access capabilities. The success of this paradigm has led to a number of languages such as DL-Lite, Datalog+/and OWL RL. The two major approaches to answering queries under constraints expressed in such languages are forward-chaining (materialization) and backward-chaining (query rewriting). The latter is typically ...
متن کاملOn some inferences based on stratified forward chaining: An application to e-Government
This paper introduces first an expert system shell based on stratified forward chaining. The stratified forward chaining was proposed as a generalization for the inheritance networks with exception since it allows more than one antecedent in the premises part of a rule. Expert systems built with this tool are rule based and the user interface is web based. The practical use of this chaining is ...
متن کاملDeductive databases and P systems
In computational processes based on backwards chaining, a rule of the type A ← B1, . . . , Bn is seen as a procedure which points that the problem A can be split into the problems B1, . . . , Bn. In classical devices, the subproblems B1, . . . , Bn are solved sequentially. In this paper we present some questions that circulated during the Second Brainstorming Week related to the application of ...
متن کاملHow to Use Cycles for Logical Compilation
Forward chaining is an algorithm that is particularly simple, and therefore used in many inference systems. It computes the facts that are the consequence of a set of facts and rules. Unfortunately, this algorithm is not complete with respect to negation. To solve this problem, it is possible, in the context of propositional calculus, to automatically add the rules needed to make computations w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Data Knowl. Eng.
دوره 10 شماره
صفحات -
تاریخ انتشار 1993